Pseudodeterminants and perfect square spanning tree counts
نویسنده
چکیده
The pseudodeterminant pdet(M) of a square matrix is the last nonzero coefficient in its characteristic polynomial; for a nonsingular matrix, this is just the determinant. If ∂ is a symmetric or skewsymmetric matrix then pdet(∂∂t) = pdet(∂)2. Whenever ∂ is the kth boundary map of a self-dual CWcomplex X, this linear-algebraic identity implies that the torsion-weighted generating function for cellular k-trees in X is a perfect square. In the case that X is an antipodally self-dual CW-sphere of odd dimension, the pseudodeterminant of its kth cellular boundary map can be interpreted directly as a torsion-weighted generating function both for k-trees and for (k − 1)-trees, complementing the analogous result for evendimensional spheres given by the second author. The argument relies on the topological fact that any self-dual even-dimensional CW-ball can be oriented so that its middle boundary map is skew-symmetric.
منابع مشابه
0 Trees and Matchings Richard
In this article, Temperley’s bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. We show that the weighted, directed spann...
متن کاملTrees and Matchings
In this article, Temperley’s bijection between spanning trees of a subgraph of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of an associated subgraph of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. W...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کامل